66 research outputs found

    Breaking the Blockage for Big Data Transmission: Gigabit Road Communication in Autonomous Vehicles

    Get PDF
    Recently, the spectrum band beyond 60 GHz has attracted attention with the growth of traffic demand. Previous studies assumed that these bands are not suitable for vehicle communications due to the short range and high rate of blockage. However, it also means that there is no existing service or regulation designed for these bands, which makes this area free to apply. Therefore, in this article, we draw a potential map of THz vehicle transmission for autonomous vehicles to break the blockage of short-range and unstable links. First, we give a brief overview of possible waveforms followed by the specific channel at 0.1-1 THz. Then we propose an autonomous relay algorithm called ATLR for the gigabit-level communication in the high-speed road environment. Finally, we discuss how the THz transmission helps relieve the interference problem and provide extra data to support various instructions in autonomous vehicles

    Revenue generation for truthful spectrum auction in dynamic spectrum access

    Get PDF
    Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to incentivize the primary license holders to open up their under-utilized spectrum for sharing. In this paper we present a secondary spectrum market where a primary license holder can sell access to its unused or under-used spectrum resources in the form of certain fine-grained spectrumspace-time unit. Secondary wireless service providers can purchase such contracts to deploy new service, enhance their existing service, or deploy ad hoc service to meet flash crowds demand. Within the context of this market, we investigate how to use auction mechanisms to allocate and price spectrum resources so that the primary license holder’s revenue is maximized. We begin by classifying a number of alternative auction formats in terms of spectrum demand. We then study a specific auction format where secondary wireless service providers have demands for fixed locations (cells). We propose an optimal auction based on the concept of virtual valuation. Assuming the knowledge of valuation distributions, the optimal auction uses the Vickrey-Clarke-Groves (VCG) mechanism to maximize the expected revenue while enforcing truthfulness. To reduce the computational complexity, we further design a truthful suboptimal auction with polynomial time complexity. It uses a monotone allocation and critical value payment to enforce truthfulness. Simulation results show that this suboptimal auction can generate stable expected revenue

    Multi-Job Intelligent Scheduling with Cross-Device Federated Learning

    Full text link
    Recent years have witnessed a large amount of decentralized data in various (edge) devices of end-users, while the decentralized data aggregation remains complicated for machine learning jobs because of regulations and laws. As a practical approach to handling decentralized data, Federated Learning (FL) enables collaborative global machine learning model training without sharing sensitive raw data. The servers schedule devices to jobs within the training process of FL. In contrast, device scheduling with multiple jobs in FL remains a critical and open problem. In this paper, we propose a novel multi-job FL framework, which enables the training process of multiple jobs in parallel. The multi-job FL framework is composed of a system model and a scheduling method. The system model enables a parallel training process of multiple jobs, with a cost model based on the data fairness and the training time of diverse devices during the parallel training process. We propose a novel intelligent scheduling approach based on multiple scheduling methods, including an original reinforcement learning-based scheduling method and an original Bayesian optimization-based scheduling method, which corresponds to a small cost while scheduling devices to multiple jobs. We conduct extensive experimentation with diverse jobs and datasets. The experimental results reveal that our proposed approaches significantly outperform baseline approaches in terms of training time (up to 12.73 times faster) and accuracy (up to 46.4% higher).Comment: To appear in TPDS; 22 pages, 17 figures, 8 tables. arXiv admin note: substantial text overlap with arXiv:2112.0592

    Wheat beta-expansin (EXPB11) genes: Identification of the expressed gene on chromosome 3BS carrying a pollen allergen domain

    Get PDF
    Background Expansins form a large multi-gene family found in wheat and other cereal genomes that are involved in the expansion of cell walls as a tissue grows. The expansin family can be divided up into two main groups, namely, alpha-expansin (EXPA) and beta-expansin proteins (EXPB), with the EXPB group being of particular interest as group 1-pollen allergens. Results In this study, three beta-expansin genes were identified and characterized from a newly sequenced region of the Triticum aestivum cv. Chinese Spring chromosome 3B physical map at the Sr2 locus (FPC contig ctg11). The analysis of a 357 kb sub-sequence of FPC contig ctg11 identified one beta-expansin genes to be TaEXPB11, originally identified as a cDNA from the wheat cv Wyuna. Through the analysis of intron sequences of the three wheat cv. Chinese Spring genes, we propose that two of these beta-expansin genes are duplications of the TaEXPB11 gene. Comparative sequence analysis with two other wheat cultivars (cv. Westonia and cv. Hope) and a Triticum aestivum var. spelta line validated the identification of the Chinese Spring variant of TaEXPB11. The expression in maternal and grain tissues was confirmed by examining EST databases and carrying out RT-PCR experiments. Detailed examination of the position of TaEXPB11 relative to the locus encoding Sr2 disease resistance ruled out the possibility of this gene directly contributing to the resistance phenotype. Conclusions Through 3-D structural protein comparisons with Zea mays EXPB1, we proposed that variations within the coding sequence of TaEXPB11 in wheats may produce a functional change within features such as domain 1 related to possible involvement in cell wall structure and domain 2 defining the pollen allergen domain and binding to IgE protein. The variation established in this gene suggests it is a clearly identifiable member of a gene family and reflects the dynamic features of the wheat genome as it adapted to a range of different environments and uses

    Type IIn Supernova SN 2010jl: Optical Observations for Over 500 Days After Explosion

    Full text link
    We present extensive optical observations of a Type IIn supernova (SN) 2010jl for the first 1.5 years after the discovery. The UBVRI light curves demonstrated an interesting two-stage evolution during the nebular phase, which almost flatten out after about 90 days from the optical maximum. SN 2010jl has one of the highest intrinsic H_alpha luminosity ever recorded for a SN IIn, especially at late phase, suggesting a strong interaction of SN ejecta with the dense circumstellar material (CSM) ejected by the progenitor. This is also indicated by the remarkably strong Balmer lines persisting in the optical spectra. One interesting spectral evolution about SN 2010jl is the appearance of asymmetry of the Balmer lines. These lines can be well decomposed into a narrow component and an intermediate-width component. The intermediate-width component showed a steady increase in both strength and blueshift with time until t ~ 400 days after maximum, but it became less blueshifted at t ~ 500 days when the line profile appeared relatively symmetric again. Owing to that a pure reddening effect will lead to a sudden decline of the light curves and a progressive blueshift of the spectral lines, we therefore propose that the asymmetric profiles of H lines seen in SN 2010jl is unlikely due to the extinction by newly formed dust inside the ejecta, contrary to the explanation by some early studies. Based on a simple CSM-interaction model, we speculate that the progenitor of SN 2010jl may suffer a gigantic mass loss (~ 30-50 M_sun) in a few decades before explosion. Considering a slow moving stellar wind (e.g., ~ 28 km/s) inferred for the preexisting, dense CSM shell and the extremely high mass-loss rate (1-2 M_sun per yr), we suggest that the progenitor of SN 2010jl might have experienced a red supergiant stage and explode finally as a post-red supergiant star with an initial mass above 30-40 M_sun.Comment: 34 pages, 9 figures, accepted for publication in A

    Genome-wide association study of lung adenocarcinoma in East Asia and comparison with a European population

    Get PDF
    Lung adenocarcinoma is the most common type of lung cancer. Known risk variants explain only a small fraction of lung adenocarcinoma heritability. Here, we conducted a two-stage genome-wide association study of lung adenocarcinoma of East Asian ancestry (21,658 cases and 150,676 controls; 54.5% never-smokers) and identified 12 novel susceptibility variants, bringing the total number to 28 at 25 independent loci. Transcriptome-wide association analyses together with colocalization studies using a Taiwanese lung expression quantitative trait loci dataset (n = 115) identified novel candidate genes, including FADS1 at 11q12 and ELF5 at 11p13. In a multi-ancestry meta-analysis of East Asian and European studies, four loci were identified at 2p11, 4q32, 16q23, and 18q12. At the same time, most of our findings in East Asian populations showed no evidence of association in European populations. In our studies drawn from East Asian populations, a polygenic risk score based on the 25 loci had a stronger association in never-smokers vs. individuals with a history of smoking (P interaction  = 0.0058). These findings provide new insights into the etiology of lung adenocarcinoma in individuals from East Asian populations, which could be important in developing translational applications

    Genome-wide association study of lung adenocarcinoma in East Asia and comparison with a European population.

    Get PDF
    Lung adenocarcinoma is the most common type of lung cancer. Known risk variants explain only a small fraction of lung adenocarcinoma heritability. Here, we conducted a two-stage genome-wide association study of lung adenocarcinoma of East Asian ancestry (21,658 cases and 150,676 controls; 54.5% never-smokers) and identified 12 novel susceptibility variants, bringing the total number to 28 at 25 independent loci. Transcriptome-wide association analyses together with colocalization studies using a Taiwanese lung expression quantitative trait loci dataset (n = 115) identified novel candidate genes, including FADS1 at 11q12 and ELF5 at 11p13. In a multi-ancestry meta-analysis of East Asian and European studies, four loci were identified at 2p11, 4q32, 16q23, and 18q12. At the same time, most of our findings in East Asian populations showed no evidence of association in European populations. In our studies drawn from East Asian populations, a polygenic risk score based on the 25 loci had a stronger association in never-smokers vs. individuals with a history of smoking (Pinteraction = 0.0058). These findings provide new insights into the etiology of lung adenocarcinoma in individuals from East Asian populations, which could be important in developing translational applications

    Cognitive radio networks for dynamic spectrum management

    No full text
    A fundamental evolution is witnessed in recent research and development of wireless communications: much effort is put on shifting from the current static spectrum management to a dynamic one, since the wireless industry is hindered by spectrum scarcity while most of allocated spectrum stays idle. To realize the paradigm of dynamic spectrum management, cognitive radio network is a promising way. In this thesis, we present our current research status on dynamic spectrum management and cognitive radio networking, under a unified framework including both economic and technological aspects. We first investigate the economic feasibility of dynamic spectrum management in the form of dynamic spectrum market. Market mechanisms are proposed to stimulate primary (licensed) users to open up their under-utilized spectrum bands for secondary (unlicensed) users. We further analyze the competitive behavior of the major players in wireless industry, wireless service providers, in such a spectrum market. Then we switch to the technical realization part. We address several unique issues within cognitive radio networking. One is about the spectrum sensing strategy of secondary nodes. A MAC protocol is proposed to conduct efficient spectrum sensing and access in ad hoc cognitive networks, taking the hardware constraints into consideration. Another is about spectrum heterogeneity. We propose a cooperative relaying scheme and prove the effectiveness with a real testbed. Finally, we describe our current work about cognitive radio network testbed construction. The testbed has both fine programmability and high performance, which is quite useful for concept verification and performance evaluation

    Rendezvous Protocols Based on Message Passing in Cognitive Radio Networks

    No full text
    In cognitive radio networks, secondary users need to first discover neighbours and form communication links, referred to as the rendezvous process. Rendezvous between any two secondary users can only be achieved on the same channel. However, spectrum heterogeneity in cognitive radio networks complicates the rendezvous process. While most of the existing works study pair-wise rendezvous and design channel hopping sequence, in this paper we focus on the general rendezvous problem for multiple users where each user needs to discover all of its neighbours. We propose to maintain and exchange rendezvous information among encountered users, and leverage rendezvous information spread within the network to accelerate the rendezvous process. With such an idea, we propose a general message passing based framework for rendezvous protocol design, which is flexible to incorporate the existing sequence generation algorithms. For the framework, we formulate rendezvous problems from the perspective of individual user, prove the NP-completeness, and propose an efficient greedy channel switching algorithm. Based on the framework, we design several rendezvous protocols for single-hop and multi-hop networks. When channel hopping sequence generation algorithms with guaranteed rendezvous between any two users are used, the rendezvous with the proposed protocols can still be guaranteed. Simulations demonstrate that the rendezvous performance is greatly improved
    • …
    corecore